Matrix Powers of Column-justified Pascal Triangles and Fibonacci Sequences
نویسنده
چکیده
It is known that if Ln, respectively Rn9 are n x n matrices with the (/, j ) * entry the binomial coefficient (y~l)? respectively (^l)), then Ln = In (mod 2), respectively R„=In (mod 2), where In is the identity matrix of dimension n>\ (see, e.g., Problem PI 073 5 in the May 1999 issue of Arner. Math Monthly). The entries of Ln form a left-justified Pascal triangle and the entries of Rn result from taking the mirror-image of this triangle with respect to its first column. The questions we ask are: Can this result be extended to other primes or, better yet, is it possible to find a closed form for the entries of powers of Ln and Rnl Ln succumbs easily, as we shall see in our first result. Rn in turn fights back, since closed forms for its powers are not found. However, we show a beautiful connection between matrices similar to Rn and the Fibonacci numbers. If n 2, the connection is easily seen, since
منابع مشابه
Large primes in generalized Pascal triangles
In this paper, after presenting the results of the generalization of Pascal triangle (using powers of base numbers), we examine some properties of the 112-based triangle, most of all regarding to prime numbers. Additionally, an effective implementation of ECPP method is presented which enables Magma computer algebra system to prove the primality of numbers with more than 1000 decimal digits. 1 ...
متن کاملGeneralized Pascal triangles and Toeplitz matrices
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see R. Bacher. Determinants of matrices related to the Pascal triangle. J. Théor. Nombres Bordeaux, 14:19–41, 2002). This article presents a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a Toeplitz matrix, and a unipotent upper triang...
متن کاملNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملar X iv : 0 90 1 . 25 97 v 1 [ m at h . R A ] 1 9 Ja n 20 09 GENERALIZED PASCAL TRIANGLES AND TÖEPLITZ MATRICES ∗
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a Töeplitz matrix and a unipotent upper triangular matrix. The determinant of a generalized Pascal matrix equals thus the determinant of a Töeplitz matrix. This equa...
متن کاملFibonacci words in hyperbolic Pascal triangles
The hyperbolic Pascal triangle HPT 4,q (q ≥ 5) is a new mathematical construction, which is a geometrical generalization of Pascal’s arithmetical triangle. In the present study we show that a natural pattern of rows of HPT 4,5 is almost the same as the sequence consisting of every second term of the well-known Fibonacci words. Further, we give a generalization of the Fibonacci words using the h...
متن کامل